Log-Sobolev inequalities and sampling from log-concave distributions
نویسندگان
چکیده
منابع مشابه
Efficient Sampling from Time-Varying Log-Concave Distributions
We propose a computationally efficient random walk on a convex body which rapidly mixes and closely tracks a time-varying logconcave distribution. We develop general theoretical guarantees on the required number of steps; this number can be calculated on the fly according to the distance from and the shape of the next distribution. We then illustrate the technique on several examples. Within th...
متن کاملLearning Multivariate Log-concave Distributions
We study the problem of estimating multivariate log-concave probability density functions. We prove the first sample complexity upper bound for learning log-concave densities on Rd, for all d ≥ 1. Prior to our work, no upper bound on the sample complexity of this learning problem was known for the case of d > 3. In more detail, we give an estimator that, for any d ≥ 1 and ǫ > 0, draws Õd ( (1/ǫ...
متن کاملModified Log-sobolev Inequalities and Isoperimetry
We find sufficient conditions for a probability measure μ to satisfy an inequality of the type ∫ Rd fF ( f ∫ Rd f 2 dμ ) dμ ≤ C ∫ Rd f2c∗ ( |∇f | |f | ) dμ + B ∫ Rd f dμ, where F is concave and c (a cost function) is convex. We show that under broad assumptions on c and F the above inequality holds if for some δ > 0 and ε > 0 one has ∫ ε 0 Φ ( δc [ tF ( 1t ) Iμ(t) ]) dt <∞, where Iμ is the isop...
متن کاملInference and Modeling with Log-concave Distributions
Log-concave distributions are an attractive choice for modeling and inference, for several reasons: The class of log-concave distributions contains most of the commonly used parametric distributions and thus is a rich and flexible nonparametric class of distributions. Further, the MLE exists and can be computed with readily available algorithms. Thus, no tuning parameter, such as a bandwidth, i...
متن کاملClustering with mixtures of log-concave distributions
The EM algorithm is a popular tool for clustering observations via a parametric mixture model. Two disadvantages of this approach are that its success depends on the appropriateness of the assumed parametric model, and that each model requires a different implementation of the EM algorithm based on model-specific theoretical derivations. We show how this algorithm can be extended to work with t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1999
ISSN: 1050-5164
DOI: 10.1214/aoap/1029962595